Heuristics for NP-hard optimization problems - simpler is better!?
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for NP-hard optimization problems
In this chapter, we discuss approximation algorithms for optimization problems. An optimization problem consists in finding the best (cheapest, heaviest, etc.) element in a large set P, called the feasible region and usually specified implicitly, where the quality of elements of the set are evaluated using a function f(x), the objective function, usually something fairly simple. The element tha...
متن کاملRigorous analysis of heuristics for NP-hard problems
NP-hard optimization problems have to be solved in practice. Since it is our belief that there are no efficient algorithms that always solve such problems, we seek for heuristic algorithms that perform well ”most of the time”. This brings up the important issue of how to evaluate the quality of heuristics. One common criteria is the approximation ratio which gives a worst case guarantee for the...
متن کاملAlgorithms for NP-hard Optimization Problems and Cluster Analysis
Algorithms for NP-hard Optimization Problems and Cluster Analysis by Nan Li The set cover problem, weighted set cover problem, minimum dominating set problem and minimum weighted dominating set problem are all classical NP-hard optimization problems of great importance in both theory and real applications. Since the exact algorithms, which require exhaustive exploration of exponentially many op...
متن کاملApproximation schemes for NP-hard geometric optimization problems: a survey
NP-hard geometric optimization problems arise in many disciplines. Perhaps the most famous one is the traveling salesman problem (TSP): given n nodes in<2 (more generally, in<d), find the minimum length path that visits each node exactly once. If distance is computed using the Euclidean norm (distance between nodes (x1, y1) and (x2, y2) is ((x1−x2)+(y1−y2))) then the problem is called Euclidean...
متن کاملHeuristics from Nature for Hard Combinatorial Optimization Problems
In this paper we try to describe the main characters of Heuristics \derived" from Nature, a border area between Operations Research and Arti cial Intelligence, with applications to graph optimization problems. These algorithms take inspiration from physics, biology, social sciences, and use a certain amount of repeated trials, given by one or more \agents" operating with a mechanism of competit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logistics & Sustainable Transport
سال: 2015
ISSN: 2232-4968
DOI: 10.1515/jlst-2015-0006